The reflexive re-nonnegative definite solution to a quaternion matrix equation
نویسندگان
چکیده
In this paper a necessary and sufficient condition is established for the existence of the reflexive re-nonnegative definite solution to the quaternion matrix equation AXA∗ = B, where ∗ stands for conjugate transpose. The expression of such solution to the matrix equation is also given. Furthermore, a necessary and sufficient condition is derived for the existence of the general re-nonnegative definite solution to the quaternion matrix equation A1X1A1 + A2X2A ∗ 2 = B. The representation of such solution to the matrix equation is given.
منابع مشابه
Ela the Reflexive Re-nonnegative Definite Solution to a Quaternion Matrix Equation∗
In this paper a necessary and sufficient condition is established for the existence of the reflexive re-nonnegative definite solution to the quaternion matrix equation AXA∗ = B, where ∗ stands for conjugate transpose. The expression of such solution to the matrix equation is also given. Furthermore, a necessary and sufficient condition is derived for the existence of the general re-nonnegative ...
متن کاملThe least-square bisymmetric solution to a quaternion matrix equation with applications
In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملAn Efficient Algorithm for the Reflexive Solution of the Quaternion Matrix Equation AXB + CXHD = F
We propose an iterative algorithm for solving the reflexive solution of the quaternion matrix equation AXB + CXHD = F. When the matrix equation is consistent over reflexive matrix X, a reflexive solution can be obtained within finite iteration steps in the absence of roundoff errors. By the proposed iterative algorithm, the least Frobenius norm reflexive solution of the matrix equation can be d...
متن کاملThe General Hermitian Nonnegative-definite Solution to the Matrix Equation Axa∗ + by B∗ = C
Consider the matrix equation AXA∗ + BY B∗ = C. A matrix pair (X0, Y0) is called a Hermitian nonnegative-definite solution to the matrix equation if X0 and Y0 are Hermitian nonnegative-definite and satisfy AX0A∗ + BY0B∗ = C. We give necessary and sufficient conditions for the existence of a Hermitian nonnegative-definite solution to the matrix equation, and further derive a representation of the...
متن کامل